//给你一个升序排列的数组 nums,请你原地删除重复出现的元素,使每个元素只出现一次,返回删除后数组的新长度(顺序不变)
int removeDuplicates(int* nums, int numsSize) {
	int count, n;
	count = n = 0;
	for (int i = 1; i < numsSize; i++) {
		if (nums[i] == nums[n])
			count++;
		else{
			nums[i - count] = nums[i];
			n++;
		}
	}
	return numsSize - count;
}
